Bloom Filter- Cost Effective Paging Mechanism
نویسندگان
چکیده
In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging while locating mobile users. Reduction of communication overhead has become a burning issue of today. It induces the intellects to innovate some means which are cost reducing by nature. Location management aims to reduce this overhead through prediction of the user location. For this paging mechanisms are adopted. In this paper a cost effective paging mechanism called Bloom Filtering is proposed which surpasses other techniques such as Simultaneous paging and Sequential paging in matter of cost reduction. Keywords— Location management, Paging, Simultaneous paging, Sequential paging, Bloom filtering.
منابع مشابه
Hash-Based Paging and Location Update Using Bloom Filters
We develop and analyze a hash-based paging and location update technique that reduces the paging cost in cellular systems. By applying a Bloom filter, the terminal identifier field of a paging message is coded to page a number of terminals concurrently. A small number of terminals may wake up and send what we call “false location updates” although they are not being paged. We compare the total ...
متن کاملEffective Multi Keyword Search over P2p Network Using Optimized Bloom Filter Settings
P2P network is a popular technology used for sharing and searching files on the computers connected to the network. Current search mechanisms of peer-to-peer (P2P) systems can well handle a single keyword search problem. Other than single keyword search, multi keyword search is very popular and useful in many file sharing applications. For multi keyword search, the solution which merges the res...
متن کاملA Cuckoo Filter Modification Inspired by Bloom Filter
Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols. They are compact representation of data that use hash functions to randomize a set of items. Being able to store more elements while keeping a reaso...
متن کاملBLIP: Non-interactive Differentially-Private Similarity Computation on Bloom filters
In this paper, we consider the scenario in which the profile of a user is represented in a compact way, as a Bloom filter, and the main objective is to privately compute in a distributed manner the similarity between users by relying only on the Bloom filter representation. In particular, we aim at providing a high level of privacy with respect to the profile even if a potentially unbounded num...
متن کاملBloom filter-based workflow management to enable QoS guarantee in wireless sensor networks
As a popular service composition technology, workflow has been successfully used in wireless sensor networks (WSNs) to compose a set of atomic services for service-oriented WSN applications. However, in a resource-constrained WSN, the sensed data is usually inaccurate or even missing, and this affects the normal execution of atomic services and may result in the non-guaranteed workflow QoS. Bec...
متن کامل